Every morphism is the restriction of a toric one
نویسندگان
چکیده
منابع مشابه
Resolving Singularities of Plane Analytic Branches with One Toric Morphism
Let (C; 0) be an irreducible germ of complex plane curve. Let ? N be the semigroup associated to it and C ? C g+1 the corresponding monomial curve, where g is the number of Puiseux exponents of (C; 0). We show, using the specialization of (C;0) to (C ? ; 0), that the same toric morphisms
متن کاملEvery Iterated Morphism Yields a co-CFL
Recently, Main [3] and Main, Bucher and Haussler [4] disproved quite a lot of conjectures about various classes of context-free languages by showing that the complement of the set of left factors of the T h u e M o r s e sequence and of other related infinite words is context-free. The aim of this article is to extend the latter result by showing, with almost the same proof technique, that, for...
متن کاملModules for which every non-cosingular submodule is a summand
A module $M$ is lifting if and only if $M$ is amply supplemented and every coclosed submodule of $M$ is a direct summand. In this paper, we are interested in a generalization of lifting modules by removing the condition"amply supplemented" and just focus on modules such that every non-cosingular submodule of them is a summand. We call these modules NS. We investigate some gen...
متن کاملWhen every $P$-flat ideal is flat
In this paper, we study the class of rings in which every $P$-flat ideal is flat and which will be called $PFF$-rings. In particular, Von Neumann regular rings, hereditary rings, semi-hereditary ring, PID and arithmetical rings are examples of $PFF$-rings. In the context domain, this notion coincide with Pr"{u}fer domain. We provide necessary and sufficient conditions for...
متن کاملEvery Sequence Is Decompressible from a Random One
Kučera and Gács independently showed that every infinite sequence is Turing reducible to a Martin-Löf random sequence. This result is extended by showing that every infinite sequence S is Turing reducible to a Martin-Löf random sequence R such that the asymptotic number of bits of R needed to compute n bits of S, divided by n, is precisely the constructive dimension of S. It is shown that this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Research Letters
سال: 2002
ISSN: 1073-2780,1945-001X
DOI: 10.4310/mrl.2002.v9.n5.a6